Detecting Almost Symmetries of Graphs
نویسندگان
چکیده
We present a branch-and-bound framework to solve the following problem: Given a graph G and an integer k, find a subgraph of G formed by removing no more than k edges that contains the most symmetry. We call symmetries on such a subgraph “almost symmetries” of G. We implement our branch-and-bound framework in PEBBL to allow for parallel enumeration and demonstrate good scaling up to 16 cores. We show that the presented branching strategy is much better than a random branching strategy on the tested graphs.
منابع مشابه
Almost-symmetries of Graphs
Many successful uses of symmetries in discrete computational problems rely on group-theoretical properties. Almost-symmetries can be more numerous, but do not have the same properties. In this work, we study almost-symmetries of graphs, proposing data structures for representing them, algorithms for finding them, and logic predicates for symmetry-breaking.
متن کاملDetecting Modular ACU Structural Symmetries
We present an efficient encoding of order-sorted modular ACU terms into colored directed graphs. Then, by computing the automorphism groups of the encoded graphs, we are able to extract modular ACU structural symmetries both inside a term and across a set of terms. Finally, we show how the computed symmetries can be applied to the optimization of the equational generalization algorithms for mod...
متن کاملExact recovery with symmetries for the Doubly-Stochastic relaxation
Graph matching or quadratic assignment, is the problem of labeling the vertices of two graphs so that they are as similar as possible. A common method for approximately solving the NP-hard graph matching problem is relaxing it to a convex optimization problem over the set of doubly stochastic matrices. Recent analysis has shown that for almost all pairs of isomorphic and asymmetric graphs, the ...
متن کاملShape Analysis with Subspace Symmetries
We address the problem of partial symmetry detection, i.e., the identification of building blocks a complex shape is composed of. Previous techniques identify parts that relate to each other by simple rigid mappings, similarity transforms, or, more recently, intrinsic isometries. Our approach generalizes the notion of partial symmetries to more general deformations. We introduce subspace symmet...
متن کاملNew Solutions for Fokker-Plank Equation of Special Stochastic Process via Lie Point Symmetries
In this paper Lie symmetry analysis is applied in order to find new solutions for Fokker Plank equation of Ornstein-Uhlenbeck process. This analysis classifies the solutions format of the Fokker Plank equation by using the Lie algebra of the symmetries of our considered stochastic process.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015